Convex Matroid Optimization
ثبت نشده
چکیده
We consider a problem of maximizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally intractable, we show that it is efficiently solvable when a suitable parameter is restricted.
منابع مشابه
L-convex Functions and M- Convex Functions Encyclopedia of Optimization (kluwer)
In the eld of nonlinear programming (in continuous variables) convex analysis [21, 22] plays a pivotal role both in theory and in practice. An analogous theory for discrete optimization (nonlinear integer programming), called \discrete convex analysis" [18, 17], is developed for L-convex and M-convex functions by adapting the ideas in convex analysis and generalizing the results in matroid theo...
متن کاملFundamentals in Discrete Convex Analysis
“Discrete Convex Analysis” is aimed at establishing a novel theoretical framework for solvable discrete optimization problems by means of a combination of the ideas in continuous optimization and combinatorial optimization. The theoretical framework of convex analysis is adapted to discrete settings and the mathematical results in matroid/submodular function theory are generalized. Viewed from ...
متن کاملDiscrete convex analysis
Discrete convex analysis [18, 40, 43, 47] aims to establish a general theoretical framework for solvable discrete optimization problems by means of a combination of the ideas in continuous optimization and combinatorial optimization. The framework of convex analysis is adapted to discrete settings and the mathematical results in matroid/submodular function theory are generalized. Viewed from th...
متن کاملConvex Matroid Optimization
We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a suitable parameter is restricted.
متن کاملEuler Polytopes and Convex Matroid Optimization
Del Pia and Michini recently improved the upper bound of kd due to Kleinschmidt and Onn for the largest possible diameter of the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. We introduce Euler polytopes which include a family of lattice polytopes with diameter (k + 1)d/2, and thus reduce the gap between the lower and upper bounds. In addition, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003